Denotational Semantics for Probabilistic Refusal Testing

In this paper, refusal testing ideas are applied to deene a testing semantics for a probabilistic process algebra. A testing equivalence is deened by combining the greater discriminatory power of refusal testing and a simple treatment of the prob-abilistic component of processes. This testing equivalence is characterized by two fully abstract denotational semantics. The rst of them is based on probabilistic refusal traces. These traces condense the set of tests that a process passes with probability greater than zero. The second one is based on a probabilistic extension of classical acceptance trees, where semantic processes can be viewed as (syntactic) normal forms.